#include<iostream>
#include<string>
#include<cmath>
using namespace std;
typedef long long LL;
const int N = 110;
int n, m, k;
int a, b;
int c[N], d[N];
int main()
{
	int t;
	cin >> t;
	while (t--) {
		cin >> n >> m >> k;
		cin >> a >> b;
		for (int i = 1; i <= k; i++) {
			cin >> c[i] >> d[i];
		}
		bool flag = 0;
		for (int i = 1; i <= k; i++) {
			int x = abs(a - c[i]) + abs(b - d[i]);
			if (x % 2 == 0) {
				flag = 1;
				break;
			}
		}
		if (flag)cout << "No" << endl;
		else cout << "Yes" << endl;
		/*else {
			bool f1 = 0, f2 = 0, f3 = 0, f4 = 0;
			bool f5 = 0;
			for (int i = 1; i <= k; i++) {
				if (c[i] <= a) {
					if (d[i] >= b)f1 = 1;
					else f2 = 1;
				}
				else {
					if (d[i] >= b)f3 = 1;
					else f4 = 1;
				}
				if(abs(a-c[i])+abs(b-d[i])==1)
			}
			if (f1 && f2 && f3 && f4) {
				cout << "Yes" << endl;
			}
			
		}*/
	}
	return 0;
}